Origami edge-paths in the curve graph

نویسندگان

چکیده

An origami (or flat structure) on a closed oriented surface, Sg, of genus g≥2 is obtained from finite collection unit Euclidean squares by gluing each right edge to left one and top bottom one. The main objects study in this note are pairs curves—filling simple curves, (α,β), Sg such that their minimal intersection equal algebraic intersection—they coherent. pair curves naturally associated with an Sg. Our result establishes for any there exists edge-path, sequence α=α0,α1,α2,⋯,αn=β, that: αi intersects αi+1 exactly once; (αi,αj) coherent; thus, filling pair, (αi,αj), also origami. With existence established, we offer shortest edge-paths as area investigation.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The edge tenacity of a split graph

The edge tenacity Te(G) of a graph G is dened as:Te(G) = min {[|X|+τ(G-X)]/[ω(G-X)-1]|X ⊆ E(G) and ω(G-X) > 1} where the minimum is taken over every edge-cutset X that separates G into ω(G - X) components, and by τ(G - X) we denote the order of a largest component of G. The objective of this paper is to determine this quantity for split graphs. Let G = (Z; I; E) be a noncomplete connected split...

متن کامل

THE (△,□)-EDGE GRAPH G△,□ OF A GRAPH G

To a simple graph $G=(V,E)$, we correspond a simple graph $G_{triangle,square}$ whose vertex set is ${{x,y}: x,yin V}$ and two vertices ${x,y},{z,w}in G_{triangle,square}$ are adjacent if and only if ${x,z},{x,w},{y,z},{y,w}in Vcup E$. The graph $G_{triangle,square}$ is called the $(triangle,square)$-edge graph of the graph $G$. In this paper, our ultimate goal is to provide a link between the ...

متن کامل

Unit Origami as Graph Theory

In the search for innovative material to teach high school mathematics students more and more teachers are turning to graph theory. This subject provides an absract, powerful and very modern way to model any type of network structure, from telephone networks to the human central nervous system. One of the most engaging ways to teach graph theory is with unit origami. In this paper we will discu...

متن کامل

the edge tenacity of a split graph

the edge tenacity te(g) of a graph g is de ned as:te(g) = min {[|x|+τ(g-x)]/[ω(g-x)-1]|x ⊆ e(g) and ω(g-x) > 1} where the minimum is taken over every edge-cutset x that separates g into ω(g - x) components, and by τ(g - x) we denote the order of a largest component of g. the objective of this paper is to determine this quantity for split graphs. let g = (z; i; e) be a noncomplete connected spli...

متن کامل

On the edge geodetic and edge geodetic domination numbers of a graph

In this paper, we study both concepts of geodetic dominatingand edge geodetic dominating sets and derive some tight upper bounds onthe edge geodetic and the edge geodetic domination numbers. We also obtainattainable upper bounds on the maximum number of elements in a partitionof a vertex set of a connected graph into geodetic sets, edge geodetic sets,geodetic domin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Topology and its Applications

سال: 2021

ISSN: ['1879-3207', '0166-8641']

DOI: https://doi.org/10.1016/j.topol.2021.107730